Classification Trees With Bivariate Linear Discriminant Node Models
نویسندگان
چکیده
منابع مشابه
Classification Trees with Bivariate Linear Discriminant Node Models
We introduce a classification tree algorithm that can simultaneously reduce tree size, improve class prediction, and enhance data visualization. We accomplish this by fitting a bivariate linear discriminant model to the data in each node. Standard algorithms can produce fairly large tree structures, because they employ a very simple node model, wherein the entire partition associated with a nod...
متن کاملRobust Linear Discriminant Trees
We present a new method for the induction of classiication trees with linear dis-criminants as the partitioning function at each internal node. This paper presents two main contributions: rst, a novel objective function called soft entropy which is used to identify optimal coeecients for the linear discriminants, and second, a novel method for removing outliers called iterative re-ltering which...
متن کاملClassification trees as an alternative to linear discriminant analysis.
Linear discriminant analysis (LDA) is frequently used for classification/prediction problems in physical anthropology, but it is unusual to find examples where researchers consider the statistical limitations and assumptions required for this technique. In these instances, it is difficult to know whether the predictions are reliable. This paper considers a nonparametric alternative to predictiv...
متن کاملSeparable Linear Discriminant Classification
Linear discriminant analysis is a popular technique in computer vision, machine learning and data mining. It has been successfully applied to various problems, and there are numerous variations of the original approach. This paper introduces the idea of separable LDA. Towards the problem of binary classification for visual object recognition, we derive an algorithm for training separable discri...
متن کاملClassification Using Linear Discriminant Analysis and Quadratic Discriminant Analysis
2 Classification of One-Dimensional Data 2 2.1 Linear Discriminant Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1.1 Building the LDA Classifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1.2 Results of One-Dimensional LDA Classification . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Quadratic Discriminant Analysis . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2003
ISSN: 1061-8600,1537-2715
DOI: 10.1198/1061860032049